The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete

نویسندگان

  • Simone Bova
  • Franco Montagna
چکیده

Commutative, integral and bounded GBL-algebras form a subvariety of residuated lattices which provides the algebraic semantics of an interesting common fragment of intuitionistic logic and of several fuzzy logics. It is known that both the equational theory and the quasiequational theory of commutative GBL-algebras are decidable (in contrast to the noncommutative case), but their complexity has not been studied yet. In this paper, we prove that both theories are in PSPACE, and that the quasiequational theory is PSPACE-hard.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Blok-Ferreirim theorem for normal GBL-algebras and its application

Generalized basic logic algebras (GBL-algebras for short) have been introduced in [JT02] as a generalization of Hájek’s BL-algebras, and constitute a bridge between algebraic logic and l-groups. In this paper we investigate normal GBL-algebras, that is, integral GBL-algebras in which every filter is normal. For these structures we prove an analogue of Blok and Ferreirim’s [BF00] ordinal sum dec...

متن کامل

Basic Logic, SMT solvers and finitely generated varieties of GBL-algebras

Basic Logic was introduced by Petr Hájek to provide a uni ed approach to fuzzy logics, and judging by its rapid adoption in the research community, it has enjoyed considerable success in this regard. One of the reasons is that while it is a very general logic, it has elegant semantics with respect to the real unit interval, which allow for practical applications and use of standard software too...

متن کامل

Embedding theorems for classes of GBL-algebras

The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBL-algebras). In particular it is shown that every n-potent GBL-algebra is embedded in a poset product of finite n-potent MV-chains, and every normal GBL-algebra is embedded in a poset product of totally ordered GMV-algebras. Representable normal GBLalgebras have poset p...

متن کامل

On the Structure of Generalized Bl-algebras

A generalized BL-algebra (or GBL-algebra for short) is a residuated lattice that satisfies the identities x ∧ y = ((x ∧ y)/y)y = y(y\(x∧ y)). It is shown that all finite GBL-algebras are commutative, hence they can be constructed by iterating ordinal sums and direct products of Wajsberg hoops. We also observe that the idempotents in a GBL-algebra form a subalgebra of elements that commute with ...

متن کامل

Relevant logic and relation algebras

In 2007, Maddux observed (see [7]) that relevant logics have a natural interpretation in the language of relation algebras, with respect to which certain standard relevant logics are sound. He asked whether this interpretation was complete as well. In 2008, Mikulás proved in [10] that the relevant logic R was not complete with respect to square-increasing, commutative, representable relation al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 410  شماره 

صفحات  -

تاریخ انتشار 2009